A Generalization of Binomial Queues

We give a generalization of binomial queues involving an arbitrary sequence (mk)k=0;1;2;::: of integers greater than one. Diierent sequences lead to diierent worst case bounds for the priority queue operations, allowing the user to adapt the data structure to the needs of a speciic application. Examples include the rst priority queue to combine a sub-logarithmic worst case bound for Meld with a sub-linear worst case bound for Delete min.